Ergodic Approach to Robust Optimization and Infinite Programming Problems
نویسندگان
چکیده
منابع مشابه
Dynamic programming approach to adjustable robust optimization
In this paper we consider the adjustable robust approach to multistage optimization, for which we derive dynamic programming equations. We also discuss this from a point of view of risk averse stochastic programming. As an example we consider a robust formulation of the classical inventory model and show that, similar to the risk neutral case, a basestock policy is optimal.
متن کاملA Robust Programming Approach to Bi-objective Optimization Model in the Disaster Relief Logistics Response Phase
Accidents and natural disasters and crises coming out of them indicate the importance of an integrated planning to reduce their effected. Therefore, disaster relief logistics is one of the main activities in disaster management. In this paper, we study the response phase of the disaster management cycle and a bi-objective model has been developed for relief chain logistic in uncertainty conditi...
متن کاملa robust programming approach to bi-objective optimization model in the disaster relief logistics response phase
abstractaccidents and natural disasters and crises coming out of them indicate the importance of an integrated planning to reduce their effected. therefore, disaster relief logistics is one of the main activities in disaster management. in this paper, we study the response phase of the disaster management cycle and a bi-objective model has been developed for relief chain logistic in uncertainty...
متن کاملA Mathematical Programming Approach to Stochastic and Dynamic Optimization Problems
We survey a new approach that the author and his co-workers have developed to formulate generic stochastic and dynamic optimization problems as mathematical programming problems. The approach has two components: (a) it produces bounds on the performance of an optimal policy, and (b) it develops techniques to construct optimal or near-optimal policies. The central idea for developing bounds is t...
متن کاملA New Approach to Solve Multiple Objective Programming Problems
Multiple Objective Programming (MOP) problems have become famous among many researchers due to more practical and realistic implementations. There have been a lot of methods proposed especially during the past four decades. In this paper, we develop a new algorithm based on a new approach to solve MOP problems by starting from a utopian point (which is usually infeasible) and moving towards the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Set-Valued and Variational Analysis
سال: 2020
ISSN: 1877-0533,1877-0541
DOI: 10.1007/s11228-020-00567-9